|
|
7.2 | Spanning-Tree Protocol | ||
| 7.2.2 | Spanning-Tree Protocol |
|
Ethernet bridges and switches can
implement the IEEE 802.1D Spanning-Tree Protocol and use the
spanning-tree algorithm to construct a loop free shortest path
network.
Shortest path is based on cumulative link costs. Link costs are based on
the speed of the link.
The Spanning-Tree Protocol establishes a root node, called the root bridge. The Spanning-Tree Protocol constructs a topology that has one path for reaching every network node. The resulting tree originates from the root bridge. Redundant links that are not part of the shortest path tree are blocked. It is because certain paths are blocked that a loop free topology is possible. Data frames received on blocked links are dropped. The Spanning-Tree Protocol requires network devices to exchange messages to detect bridging loops. Links that will cause a loop are put into a blocking state. The message that a switch sends, allowing
the formation of a loop free logical topology, is called a Bridge
Protocol Data Unit (BPDU). BPDUs continue to be received on blocked
ports. This ensures that if an active path or device fails, a new
spanning tree can be calculated.
BPDUs contain enough information so that all switches can do the following:
|